Tree-shaped Decision Schema for Multi-classification
نویسندگان
چکیده
منابع مشابه
Non-linear Cost-sensitive Decision Tree for Multi-classification
The motivation of this paper is based on a hypothesis that non-linear decision nodes provide a better classification performance than axis-parallel decision nodes do in many practical problems, such as image classification, and voice classification. The algorithm – MNCS_DT is introduced in this paper to create non-linear splits nodes by novel discriminant analysis in decision tree for multi-cla...
متن کاملPredicting Twist Condition by Bayesian Classification and Decision Tree Techniques
Railway infrastructures are among the most important national assets of countries. Most of the annual budget of infrastructure managers are spent on repairing, improving and maintaining railways. The best repair method should consider all economic and technical aspects of the problem. In recent years, data analysis of maintenance records has contributed significantly for minimizing the costs. B...
متن کاملMMDT: Multi-Objective Memetic Rule Learning from Decision Tree
In this article, a Multi-Objective Memetic Algorithm (MA) for rule learning is proposed. Prediction accuracy and interpretation are two measures that conflict with each other. In this approach, we consider accuracy and interpretation of rules sets. Additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. This...
متن کاملClassification by vertical and cutting multi-hyperplane decision tree induction
Two-group classification is a key task in decision making and data mining applications. We introduce two new mixed integer programming formulations that make use of multiple separating hyperplanes. They represent a generalization of previous piecewise-linear models that embed rules having the form of hyperplanes, which are used to successively separate the two groups. In fact, the classifiers o...
متن کاملMulti-relational Decision Tree Induction
Discovering decision trees is an important set of techniques in KDD, both because of their simple interpretation and the efficiency of their discovery. One of their disadvantages is that they do not take the structure of the mining object into account. By going from the standard single-relation approach to the multi-relational approach as in ILP this disadvantage is removed. However, the straig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Engineering and Technology Research
سال: 2017
ISSN: 2475-885X
DOI: 10.12783/dtetr/mdm2016/4900